Steady-State Scheduling
نویسنده
چکیده
In this chapter, we propose a general framework for deriving efficient (polynomial-time) algorithms for steady-state scheduling. In the context of large scale platforms (grids or volunteer computing platforms), we show that the characteristics of the resources (volatility, heterogeneity) limit their use to large regular applications. Therefore, steady-state scheduling, that consists in optimizing the number of tasks that can be processed per time unit when the number of tasks becomes arbitrarily large, is a reasonable setting. In this chapter, we concentrate on bag-of-tasks and collective communications (broadcast and multicast) applications and we prove that efficient schedules can be derived in the context of steady-state scheduling, under realistic communication models that take into account both the heterogeneity of the resources and the contentions in the communication network. 8.
منابع مشابه
Steady-State for Batches of Identical Task Graphs
In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on steady-state scheduling, and aim at reaching the optimal throughput of the system. Contrarily to previous studies, we concentrate upon the scheduling of batches of limited size. We try to reduce the processing time of each instance...
متن کاملSteady-State for Batches of Identical Task Trees
In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on steady-state scheduling, and aim at reaching the optimal throughput of the system. Contrarily to previous studies, we concentrate upon the scheduling of batches of limited size. We try to reduce the processing time of each instance...
متن کاملPractical steady-State Scheduling for Tree-Shaped Task Graphs
In this paper, we focus on the problem of scheduling a collection of similar task graphs on a heterogeneous platform, when the task graph is an intree. We rely on steady-state scheduling techniques, and aim at optimizing the throughput of the system. Contrarily to previous studies, we concentrate on practical aspects of steady-state scheduling, when dealing with a collection (or batch) of limit...
متن کاملCoordinated Planning and Scheduling of Electricity and Natural Gas Systems
In this paper we propose a model for coordinated planning of power and natural gas systems, as a part of electricity supply chain. This model takes into account costs and constraints of both systems, and with hiring simplifications and linearization methods transforms initially nonlinear formulation to a mixed integer linear programming (MILP) problem. Natural gas would be assumed steady state,...
متن کاملPerformance Analysis of Discrete Time Bulk Queues with Restricted Departure Sizes in Power Efficient Scheduling
We consider a class of discrete time bulk-service queues with buffer of infinite size where requests can be serviced in batches of given fixed sizes only. We provide techniques to obtain the steady state distribution of such queues for a general arrival process. Such queues arise out of the problem of power efficient packet scheduling in a communication system with discrete rates. Analysis of t...
متن کامل